Graph-facilitated resonant mode counting in stochastic interaction networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph-facilitated resonant mode counting in stochastic interaction networks

Oscillations in dynamical systems are widely reported in multiple branches of applied mathematics. Critically, even a non-oscillatory deterministic system can produce cyclic trajectories when it is in a low copy number, stochastic regime. Common methods of finding parameter ranges for stochastically driven resonances, such as direct calculation, are cumbersome for any but the smallest networks....

متن کامل

Stochastic Counting in Sensor Networks, or: Noise Is Good

We propose a novel algorithm of counting indistinguishable objects by a collection of sensors. The information on multiple counting is recovered from the stochastic correlation patterns.

متن کامل

Stochastic Training of Graph Convolutional Networks

Graph convolutional networks (GCNs) are powerful deep neural networks for graph-structured data. However, GCN computes nodes’ representation recursively from their neighbors, making the receptive field size grow exponentially with the number of layers. Previous attempts on reducing the receptive field size by subsampling neighbors do not have any convergence guarantee, and their receptive field...

متن کامل

Counting Graph Homomorphisms

3 Connection matrices 9 3.1 The connection matrix of a graph parameter . . . . . . . . . . . . . . . . . . . . 9 3.2 The rank of connection matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.3 Connection matrices of homomorphisms . . . . . . . . . . . . . . . . . . . . . . . 12 3.4 The exact rank of connection matrices for homomorphisms . . . . . . . . . . . . 13 3.5 Extensions...

متن کامل

Multiplexity-facilitated cascades in networks.

Elements of networks interact in many ways, so modeling them with graphs requires multiple types of edges (or network layers). Here we show that such multiplex networks are generically more vulnerable to global cascades than simplex networks. We generalize the threshold cascade model [Watts, Proc. Natl. Acad. Sci. USA 99, 5766 (2002)] to multiplex networks, in which a node activates if a suffic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of The Royal Society Interface

سال: 2017

ISSN: 1742-5689,1742-5662

DOI: 10.1098/rsif.2017.0447